Narrow your search

Library

LUCA School of Arts (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLL (2)

ULiège (2)

VIVES (2)

KU Leuven (1)

ULB (1)

VUB (1)


Resource type

book (2)


Language

English (2)


Year
From To Submit

2007 (2)

Listing 1 - 2 of 2
Sort by
Geometric folding algorithms : linkages, origami, polyhedra
Authors: ---
ISBN: 9780521857574 0521857570 9780511735172 9780521715225 9781461949183 1461949181 0511735170 9781107390430 1107390435 0521715229 9781107387515 1107387515 1139883283 1107384001 1107386209 1107398843 1107395232 Year: 2007 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.

Computing the Continuous Discretely : Integer-point Enumeration in Polyhedra
Authors: ---
ISBN: 0387461124 0387291393 1441921192 Year: 2007 Publisher: New York, NY : Springer New York : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This much-anticipated textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. Because there is no other book that puts together all of these ideas in one place, this text is truly a service to the mathematical community. We encounter here a friendly invitation to the field of "counting integer points in polytopes," also known as Ehrhart theory, and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant, and the authors' engaging style encourages such participation. The many compelling pictures that accompany the proofs and examples add to the inviting style. For teachers, this text is ideally suited as a capstone course for undergraduate students or as a compelling text in discrete mathematical topics for beginning graduate students. For scientists, this text can be utilized as a quick tooling device, especially for those who want a self-contained, easy-to-read introduction to these topics. .

Listing 1 - 2 of 2
Sort by